On timed alternating simulation for concurrent timed games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation

In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak alternating simulation as a preorder between timed game automata, which preserves controllability. We define the rules of building a symbolic turn-based two-player game such that the existence of a winning strategy is equivale...

متن کامل

Weak Alternating Timed Automata

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.

متن کامل

Modeling Timed Concurrent Systems

Timed concurrent systems are widely used in concurrent and distributed real-time software, modeling of hybrid systems, design of hardware systems (using hardware description languages), discrete-event simulation, and modeling of communication networks. They consist of concurrent components that communicate using timed signals, that is, sets of (semantically) time-stamped events. The denotationa...

متن کامل

Concurrent Timed Port Automata

We present a new and powerful class of automata which are explicitly concurrent and allow a very simple de nition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock. Message asynchrony is obtained by requiring the automata to react to every input. Explicit concurrency is obtaine...

متن کامل

Timed Concurrent State Machines

Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence­based (rather than interleaving) CSM modeling technique. TCSM support the idea of testing automata, allowing to specify time properties easier than temporal formulas. Also, calculation of a global state space in real­time domain is defined for TCSM, allowing to store a system in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Informatica

سال: 2012

ISSN: 0001-5903,1432-0525

DOI: 10.1007/s00236-012-0158-y